On local and uniformly local topological properties
نویسندگان
چکیده
منابع مشابه
On Local and Uniformly Local Topological Properties1
1. The main purpose of this paper is to show that certain properties of a metrizable space, such as local connectedness or local contractibility or LCn or local compactness, hold uniformly with a properly chosen metric.2 This result, while easy to prove, seems to be new, and often permits simplifications in proofs dealing with various kinds of local connectedness. In §2, we obtain an analogous ...
متن کاملON LOCAL BOUNDEDNESS OF I-TOPOLOGICAL VECTOR SPACES
The notion of generalized locally bounded $I$-topological vectorspaces is introduced. Some of their important properties arestudied. The relationship between this kind of spaces and thelocally bounded $I$-topological vector spaces introduced by Wu andFang [Boundedness and locally bounded fuzzy topological vectorspaces, Fuzzy Math. 5 (4) (1985) 87$-$94] is discussed. Moreover, wealso use the fam...
متن کاملSpectral Properties of Non-local Uniformly-elliptic Operators
In this paper we consider the spectral properties of a class of non-local uniformly elliptic operators, which arise from the study of non-local uniformly elliptic partial differential equations. Such equations arise naturally in the study of a variety of physical and biological systems with examples ranging from Ohmic heating to population dynamics. The operators studied here are bounded pertur...
متن کاملLocal Topological Toughness and Local Factors
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the conection between edge-toughness and factors. For the topological toughness we prove a theorem similar to Katona’s 2k-factorconjecture, which turned out to be false for his edge-toughness. We prove, that besides this the topological toughness has near...
متن کاملLocal chromatic number and topological properties of graphs
The local chromatic number of a graph, introduced by Erdős et al. in [3], is the minimum number of colors that must appear in the closed neighborhood of some vertex in any proper coloring of the graph. This talk, based on the papers [13, 14, 15], would like to survey some of our recent results on this parameter. We give a lower bound for the local chromatic number in terms of the lower bound of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1956
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1956-0077108-x